bitmasks constructive algorithms

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
void solv2() {
	int n, m;
	cin >> n >> m;
	cout << n*m << endl;


	for (int i=0; i<n; ++i) {
		for (int j=0; j<m; ++j) {
			int k = i|(j<<20);
			cout << k << " " ;
		}
		cout << endl;
	}

	return;
}


int main() {
	int t; cin >> t;

	while (t--) solv2();
	return 0;
}


Comments

Submit
0 Comments
More Questions

281A - Word Capitalization
1646A - Square Counting
266A - Stones on the Table
61A - Ultra-Fast Mathematician
148A - Insomnia cure
1650A - Deletions of Two Adjacent Letters
1512A - Spy Detected
282A - Bit++
69A - Young Physicist
1651A - Playoff
734A - Anton and Danik
1300B - Assigning to Classes
1647A - Madoka and Math Dad
710A - King Moves
1131A - Sea Battle
118A - String Task
236A - Boy or Girl
271A - Beautiful Year
520B - Two Buttons
231A - Team
479C - Exams
1030A - In Search of an Easy Problem
158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets